Choice between fixed-interval schedules: Graded versus step-like choice functions
نویسندگان
چکیده
منابع مشابه
Collective Schedules: Scheduling Meets Computational Social Choice
When scheduling public works or events in a shared facility one needs to accommodate preferences of a population. We formalize this problem by introducing the notion of a collective schedule. We show how to extend fundamental tools from social choice theory—positional scoring rules, the Kemeny rule and the Condorcet principle—to collective scheduling. We study the computational complexity of fi...
متن کاملDiscrete Choice Elasticities for the Elderly and Disabled Traveler’s Choice between Fixed-route Transit and Paratransit
INTRODUCTION The Americans with Disabilities Act (ADA), passed in 1990, required that a specialized transit service be provided to serve disabled people within 3/4 of a mile of existing standard bus routes and light rail stations. Having such services available, elderly and disabled people have a unique mode choice decision that is not available for typical travelers: the choice between public ...
متن کاملOn characterizations of the fully rational fuzzy choice functions
In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.
متن کاملConcurrent nonindependent fixed‐ratio schedules of alcohol self‐administration: Effects of schedule size on choice
Choice behavior was studied under concurrent nonindependent fixed-ratio fixed-ratio (nFR) schedules of reinforcement, as these schedules result in frequent changeover responses. With these schedules, responses on either operandum count toward the completion of the ratio requirements of both schedules. Five monkeys were subjects, and two pairs of liquid reinforcers were concurrently available: 1...
متن کاملChoice probability generating functions
This paper establishes that every random utility discrete choice model (RUM) has a representation that can be characterized by a choice-probability generating function (CPGF) with speci c properties, and that every function with these speci c properties is consistent with a RUM. The choice probabilities from the RUM are obtained from the gradient of the CPGF. Mixtures of RUM are characterized b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Experimental Analysis of Behavior
سال: 1992
ISSN: 0022-5002
DOI: 10.1901/jeab.1992.58-37